Intuitionistic common knowledge or belief

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intuitionistic common knowledge or belief

Starting off from the usual language of modal logic for multi-agent systems dealing with the agents’ knowledge/belief and common knowledge/belief we define so-called epistemic Kripke structures for intuitionistic (common) knowledge/belief. Then we introduce corresponding deductive systems and show that they are sound and complete with respect to these semantics.

متن کامل

Common Knowledge and Common Belief

Philosopher: Today, I suggest we discuss the important concepts of common knowledge and common belief. As far as I know, the first one to give a formal analysis of these concepts was the philosopher David Lewis, in his book Convention [131]. One of his examples is traffic conventions, about the role of common knowledge in how one behaves in road traffic. To explain this properly, I wonder if yo...

متن کامل

Common belief and common knowledge

But game theory as we presently know it can not proceed without the fulcrum of common knowledge. Robert Wilson (1985) In the universal belief space [Mertens and Zamir (1985)] which incorporated all situations of incomplete information concerning a state space S , we de ne a `knowledge operator' in terms of beliefs. From this operator we derive (in the usual way) the concept of common knowledge ...

متن کامل

Sequent Calculi for Temporal Logics of Common Knowledge and Belief

In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators “next” and “until”. In addition the first logic contains an indexed set of unary modal operators “agent i knows”, the second one contains an indexed set of unary modal operators “agent i believes”. Also the first log...

متن کامل

Admissibility and common belief

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all opponent strategies or on the union of the choice sets that are deemed possible for the oppo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Logic

سال: 2016

ISSN: 1570-8683

DOI: 10.1016/j.jal.2016.04.004